The Redundancy of Slepian-Wolf Coding Revisited

摘要

[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited.Applying the random binning and converse technique in \cite{yang}, the sameresults in \cite{he} are obtained with much simpler proofs. Moreover, ourresults reflect more details about the high-order terms of the coding rate. Theredundancy is investigated for both fixed-rate and variable-rate cases. Thenormal approximation (or dispersion) can also be obtained with minormodification.